Approximate Dynamic Programming Methods for Cooperative Uav Search
نویسندگان
چکیده
This paper considers the decentralized dynamic programming path planning decision processes of multiple cooperating autonomous aerial vehicles (UAVs) engaged in a search of an uncertain environment. However, what sets this paper apart from previous work is that a functional approximation is used for the dynamic programming (DP) cost-to-go function, resulting in improved quality of the decisions made while retaining computationally feasibility. Some of the effects of the changes are measured by simulation analysis, and the results are presented. Copyright c ©2005 IFAC
منابع مشابه
Simulation Analysis for Uav Search Algorithm Design Using Approximate Dynamic Programming
Many decision-and-control algorithms have been proposed for autonomous unmanned aerial vehicles (UAVs). The nature of this problem, with large decision spaces and the desire for optimal performance criteria, indicates that closed-form analysis of any approach is nearly impossible, suggesting a simulationbased performance evaluation of relevant scenarios. However, while effective simulation prac...
متن کاملSolving a Two-Period Cooperative Advertising Problem Using Dynamic Programming
Cooperative advertising is a cost-sharing mechanism in which a part of retailers' advertising investments are financed by the manufacturers. In recent years, investment among advertising options has become a difficult marketing issue. In this paper, the cooperative advertising problem with advertising options is investigated in a two-period horizon in which the market share in the second period...
متن کاملUAV Path and Sensor Planning Methods for Multiple Ground Target Search and Tracking - A Literature Survey
This report gives an overview of methods and approaches applicable to the UAV flight path and sensor aiming planning problem for search and track of multiple ground targets. The main focus of the survey is on stochastic optimal control, dynamic programming, partially observable Markov decision processes, sensor scheduling, bearings-only tracking, search and exploration. References to standard t...
متن کاملCooperative Control for UAV’s Searching Risky Environments for Targets
In this paper a model and algorithmic solution are created to control the path planning decision processes of multiple cooperating autonomous aerial vehicles engaged in a search of an uncertain and risky environment. Methods to incorporate a priori and dynamic information about the targets and to incorporate threats in a three-dimensional environment into a computationally feasible dynamic prog...
متن کاملGenetic Algorithm for Task Allocation in UAV Cooperative Control
Task allocation is one of the core steps to effectively exploit the capabilities of cooperative control of multiple Uninhabited Aerospace Vehicle (UAV) teams. Task allocation is an NP-complete problem. In this paper, we present a new task allocation algorithm that is based on the principles of genetic algorithm (GA). GA is a class of adaptive search algorithms derived from biological population...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005